Shadow algorithms for computer graphics

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Algorithms for Computer Graphics

The area of computational geometry deals with the study of algorithms for problems concerning geometric objects like e.g. lines, polygons, circles, etc. in the plane and in higher dimensional space. Since its introduction in 1976 by Shamos the field has developed rapidly and nowadays there are even special conferences and journals devoted to the topic. A list of publications by Edelsbrunner and...

متن کامل

Efficient Shadow Algorithms on Graphics Hardware

Shadows are important to computer graphics because they add realism and help the viewer identify spatial relationships. Shadows are also useful story-telling devices. For instance, artists carefully choose the shape, softness, and placement of shadows to establish mood or character. Many shadow generation techniques developed over the years have been used successfully in offline movie productio...

متن کامل

Quantum Computer Graphics Algorithms

In this paper we outline the development of a new paradigm in the field of quantum computing: quantum computer graphics. The purpose is to demonstrate how fundamental computer graphics problems can be expressed using the quantum formalism. We show that corresponding quantum computer graphics algorithms can be formulated in order to exploit the immense potential of quantum information processing...

متن کامل

Shadow Elimination and Interpolation for Computer Vision and Graphics

SHADOW ELIMINATION AND INTERPOLATION FOR COMPUTER VISION AND GRAPHICS DECEMBER 2002 by YASUYUKI MATSUSHITA Ph.D., THE UNIVERSITY OF TOKYO Directed by: Professor Masao Sakauchi Shadowing and other illumination effects give human beings rich clues to understand visual scenery. However, for many computer vision algorithms that rely on visual appearance, such illumination effects generally become m...

متن کامل

On Distributed , Probabilistic Algorithms for Computer Graphics

When attempting to solve a multi-variate optimisation problem, it is often a wise strategy to sacrifice a locally-optimal solution in the hope of finding a better global solution. Algorithms that solve optimisation problems in this manner are sometimes called hill climbing algorithms . Recently, several new hillclimbing approaches have been proposed and have gained in popularity for solving spe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGGRAPH Computer Graphics

سال: 1977

ISSN: 0097-8930

DOI: 10.1145/965141.563901